0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n026.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 16:15:29 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.22/0.36	# Version: 2.6rc1-ho
0.22/0.37	# No SInE strategy applied
0.22/0.37	# Trying AutoSched0 for 59 seconds
0.39/0.58	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.39/0.58	# and selection function SelectMaxLComplexAvoidPosPred.
0.39/0.58	#
0.39/0.58	# Preprocessing time       : 0.065 s
0.39/0.58	
0.39/0.58	# Proof found!
0.39/0.58	# SZS status Theorem
0.39/0.58	# SZS output start CNFRefutation
0.39/0.58	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.39/0.58	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.39/0.58	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.39/0.58	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.39/0.58	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_non)).
0.39/0.58	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X388:$i]:(in @ X388 @ X1=>(X2 @ X388=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.39/0.58	thf(def_n_is, axiom, (n_is)=(^[X464:$i, X465:$i]:(X464)=(X465)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.39/0.58	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.39/0.58	thf(def_n_some, axiom, (n_some)=(^[X466:$i > $o]:(![X467:$i]:(in @ X467 @ nat=>(X466 @ X467=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.39/0.58	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_diffprop)).
0.39/0.58	thf(def_l_ec, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_ec)).
0.39/0.58	thf(def_l_or, axiom, (l_or)=(^[X42:$o, X383:$o]:((X42=>~$true)=>X383)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_or)).
0.39/0.58	thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X491:$i]:(in @ X491 @ nat=>((X185)=(n_pl @ X1 @ X491)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_iii)).
0.39/0.58	thf(def_d_and, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_and)).
0.39/0.58	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X488:$i]:(in @ X488 @ nat=>((X1)=(n_pl @ X184 @ X488)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_d_29_ii)).
0.39/0.58	thf(def_lessis, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X496:$i]:(in @ X496 @ nat=>((X188)=(n_pl @ X1 @ X496)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_lessis)).
0.39/0.58	thf(def_and3, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_and3)).
0.39/0.58	thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X495:$i]:(in @ X495 @ nat=>((X1)=(n_pl @ X187 @ X495)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_moreis)).
0.39/0.58	thf(satz10d, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X204:$i]:in @ X204 @ nat) @ (^[X205:$i]:(d_not @ (d_29_ii @ X1 @ X205)<=lessis @ X1 @ X205))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz10d)).
0.39/0.58	thf(def_ec3, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_ec3)).
0.39/0.58	thf(satz10c, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X227:$i]:in @ X227 @ nat) @ (^[X228:$i]:(moreis @ X1 @ X228=>d_not @ (iii @ X1 @ X228)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz10c)).
0.39/0.58	thf(satz9b, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X191:$i]:in @ X191 @ nat) @ (^[X192:$i]:ec3 @ (n_is @ X1 @ X192) @ (n_some @ (diffprop @ X1 @ X192)) @ (n_some @ (diffprop @ X192 @ X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz9b)).
0.39/0.58	thf(c_0_22, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.39/0.58	thf(c_0_23, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.39/0.58	thf(c_0_24, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_22])).
0.39/0.58	thf(c_0_25, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X388:$i]:(in @ X388 @ X1=>(X2 @ X388=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_23]), c_0_22]), c_0_24])).
0.39/0.58	thf(c_0_26, axiom, (n_is)=(^[X464:$i, X465:$i]:(X464)=(X465)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.39/0.58	thf(c_0_27, axiom, (n_some)=(^[X466:$i > $o]:(![X467:$i]:(in @ X467 @ nat=>(X466 @ X467=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_25])).
0.39/0.58	thf(c_0_28, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_26])).
0.39/0.58	thf(c_0_29, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_ec, def_imp]), c_0_22])).
0.39/0.58	thf(c_0_30, plain, ![X696:$i, X704:$i]:(epred18_2 @ X704 @ X696<=>~((((X696)=(X704)=>![X705:$i]:(in @ X705 @ nat=>(X696)!=(n_pl @ X704 @ X705)))=>((~(![X706:$i]:(in @ X706 @ nat=>(X696)!=(n_pl @ X704 @ X706)))=>![X707:$i]:(in @ X707 @ nat=>(X704)!=(n_pl @ X696 @ X707)))=>~((~(![X708:$i]:(in @ X708 @ nat=>(X704)!=(n_pl @ X696 @ X708)))=>(X696)!=(X704))))))), introduced(definition)).
0.39/0.58	thf(c_0_31, axiom, (l_or)=(^[X42:$o, X383:$o]:((X42=>~$true)=>X383)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_22])).
0.39/0.58	thf(c_0_32, axiom, (iii)=(^[X1:$i, X185:$i]:(![X491:$i]:(in @ X491 @ nat=>((X185)=(n_pl @ X1 @ X491)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_27]), c_0_28])).
0.39/0.58	thf(c_0_33, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_and, c_0_22]), c_0_29])).
0.39/0.58	thf(c_0_34, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X488:$i]:(in @ X488 @ nat=>((X1)=(n_pl @ X184 @ X488)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_27]), c_0_28])).
0.39/0.58	thf(c_0_35, plain, ![X696:$i, X704:$i]:(epred18_2 @ X704 @ X696=>~((((X696)=(X704)=>![X705:$i]:(in @ X705 @ nat=>(X696)!=(n_pl @ X704 @ X705)))=>((~(![X706:$i]:(in @ X706 @ nat=>(X696)!=(n_pl @ X704 @ X706)))=>![X707:$i]:(in @ X707 @ nat=>(X704)!=(n_pl @ X696 @ X707)))=>~((~(![X708:$i]:(in @ X708 @ nat=>(X704)!=(n_pl @ X696 @ X708)))=>(X696)!=(X704))))))), inference(split_equiv,[status(thm)],[c_0_30])).
0.39/0.58	thf(c_0_36, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X496:$i]:(in @ X496 @ nat=>((X188)=(n_pl @ X1 @ X496)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_lessis, c_0_31]), c_0_26]), c_0_32])).
0.39/0.58	thf(c_0_37, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_and3, c_0_33])).
0.39/0.58	thf(c_0_38, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X495:$i]:(in @ X495 @ nat=>((X1)=(n_pl @ X187 @ X495)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_31]), c_0_26]), c_0_34])).
0.39/0.58	thf(c_0_39, plain, ![X1708:$i, X1709:$i, X1710:$i, X1711:$i, X1712:$i, X1713:$i]:(((X1708)!=(X1709)|(~in @ X1710 @ nat|(X1708)!=(n_pl @ X1709 @ X1710))|~epred18_2 @ X1709 @ X1708)&((~in @ X1711 @ nat|(X1708)!=(n_pl @ X1709 @ X1711)|(~in @ X1712 @ nat|(X1709)!=(n_pl @ X1708 @ X1712))|~epred18_2 @ X1709 @ X1708)&(~in @ X1713 @ nat|(X1709)!=(n_pl @ X1708 @ X1713)|(X1708)!=(X1709)|~epred18_2 @ X1709 @ X1708))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])).
0.39/0.58	thf(c_0_40, negated_conjecture, ~(![X847:$i]:(in @ X847 @ nat=>![X853:$i]:(in @ X853 @ nat=>((![X855:$i]:(in @ X855 @ nat=>(X853)!=(n_pl @ X847 @ X855))=>(X847)=(X853))=>![X854:$i]:(in @ X854 @ nat=>(X847)!=(n_pl @ X853 @ X854)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz10d]), c_0_23]), c_0_22]), c_0_34]), c_0_36])])).
0.39/0.58	thf(c_0_41, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_ec3, c_0_29]), c_0_37])).
0.39/0.58	thf(c_0_42, plain, ![X1033:$i]:(in @ X1033 @ nat=>![X1039:$i]:(in @ X1039 @ nat=>((![X1040:$i]:(in @ X1040 @ nat=>(X1033)!=(n_pl @ X1039 @ X1040))=>(X1033)=(X1039))=>![X1041:$i]:(in @ X1041 @ nat=>(X1039)!=(n_pl @ X1033 @ X1041))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz10c, c_0_23]), c_0_22]), c_0_32]), c_0_38])])).
0.39/0.58	thf(c_0_43, plain, ![X1:$i, X4:$i, X5:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|(X5)!=(X4)|~epred18_2 @ X4 @ X5), inference(split_conjunct,[status(thm)],[c_0_39])).
0.39/0.58	thf(c_0_44, negated_conjecture, (in @ esk44_0 @ nat&(in @ esk45_0 @ nat&(((in @ esk46_0 @ nat|(esk44_0)=(esk45_0))&((esk45_0)=(n_pl @ esk44_0 @ esk46_0)|(esk44_0)=(esk45_0)))&(in @ esk47_0 @ nat&(esk44_0)=(n_pl @ esk45_0 @ esk47_0))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])).
0.39/0.58	thf(c_0_45, plain, ![X696:$i]:(in @ X696 @ nat=>![X704:$i]:(in @ X704 @ nat=>epred18_2 @ X704 @ X696)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz9b, c_0_23]), c_0_41]), c_0_26]), c_0_27]), c_0_28])]), c_0_30])).
0.39/0.58	thf(c_0_46, plain, ![X1564:$i, X1565:$i, X1566:$i, X1567:$i]:((~in @ X1566 @ nat|(X1564)!=(n_pl @ X1565 @ X1566)|(~in @ X1567 @ nat|(X1565)!=(n_pl @ X1564 @ X1567))|~in @ X1565 @ nat|~in @ X1564 @ nat)&((X1564)!=(X1565)|(~in @ X1567 @ nat|(X1565)!=(n_pl @ X1564 @ X1567))|~in @ X1565 @ nat|~in @ X1564 @ nat)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])])).
0.39/0.58	thf(c_0_47, plain, ![X4:$i, X1:$i]:((n_pl @ X1 @ X4)!=(X1)|~in @ X4 @ nat|~epred18_2 @ X1 @ X1), inference(er,[status(thm)],[c_0_43])).
0.39/0.58	thf(c_0_48, negated_conjecture, (esk44_0)=(n_pl @ esk45_0 @ esk47_0), inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_49, negated_conjecture, in @ esk47_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_50, plain, ![X1501:$i, X1502:$i]:(~in @ X1501 @ nat|(~in @ X1502 @ nat|epred18_2 @ X1502 @ X1501)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])).
0.39/0.58	thf(c_0_51, plain, ![X1:$i, X6:$i, X5:$i, X4:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|~in @ X6 @ nat|(X5)!=(n_pl @ X4 @ X6)|~in @ X5 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_46])).
0.39/0.58	thf(c_0_52, negated_conjecture, ((esk45_0)!=(esk44_0)|~epred18_2 @ esk45_0 @ esk45_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])])).
0.39/0.58	thf(c_0_53, plain, ![X1:$i, X4:$i]:(epred18_2 @ X4 @ X1|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_50])).
0.39/0.58	thf(c_0_54, negated_conjecture, in @ esk45_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_55, plain, ![X1:$i, X4:$i, X5:$i]:((n_pl @ (n_pl @ X1 @ X4) @ X5)!=(X1)|~in @ (n_pl @ X1 @ X4) @ nat|~in @ X4 @ nat|~in @ X1 @ nat|~in @ X5 @ nat), inference(er,[status(thm)],[c_0_51])).
0.39/0.58	thf(c_0_56, negated_conjecture, in @ esk44_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_57, negated_conjecture, ((esk45_0)=(n_pl @ esk44_0 @ esk46_0)|(esk44_0)=(esk45_0)), inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_58, negated_conjecture, (esk45_0)!=(esk44_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54])])).
0.39/0.58	thf(c_0_59, negated_conjecture, (in @ esk46_0 @ nat|(esk44_0)=(esk45_0)), inference(split_conjunct,[status(thm)],[c_0_44])).
0.39/0.58	thf(c_0_60, negated_conjecture, ![X1:$i]:((n_pl @ esk44_0 @ X1)!=(esk45_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_48]), c_0_56]), c_0_49]), c_0_54])])).
0.39/0.58	thf(c_0_61, negated_conjecture, (n_pl @ esk44_0 @ esk46_0)=(esk45_0), inference(sr,[status(thm)],[c_0_57, c_0_58])).
0.39/0.58	thf(c_0_62, negated_conjecture, in @ esk46_0 @ nat, inference(sr,[status(thm)],[c_0_59, c_0_58])).
0.39/0.58	thf(c_0_63, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60, c_0_61]), c_0_62])]), ['proof']).
0.39/0.58	# SZS output end CNFRefutation
0.39/0.58	# Proof object total steps             : 64
0.39/0.58	# Proof object clause steps            : 17
0.39/0.58	# Proof object formula steps           : 47
0.39/0.58	# Proof object conjectures             : 15
0.39/0.58	# Proof object clause conjectures      : 12
0.39/0.58	# Proof object formula conjectures     : 3
0.39/0.58	# Proof object initial clauses used    : 9
0.39/0.58	# Proof object initial formulas used   : 22
0.39/0.58	# Proof object generating inferences   : 5
0.39/0.58	# Proof object simplifying inferences  : 13
0.39/0.58	# Training examples: 0 positive, 0 negative
0.39/0.58	# Parsed axioms                        : 352
0.39/0.58	# Removed by relevancy pruning/SinE    : 0
0.39/0.58	# Initial clauses                      : 489
0.39/0.58	# Removed in clause preprocessing      : 153
0.39/0.58	# Initial clauses in saturation        : 336
0.39/0.58	# Processed clauses                    : 633
0.39/0.58	# ...of these trivial                  : 10
0.39/0.58	# ...subsumed                          : 124
0.39/0.58	# ...remaining for further processing  : 499
0.39/0.58	# Other redundant clauses eliminated   : 264
0.39/0.58	# Clauses deleted for lack of memory   : 0
0.39/0.58	# Backward-subsumed                    : 2
0.39/0.58	# Backward-rewritten                   : 11
0.39/0.58	# Generated clauses                    : 5410
0.39/0.58	# ...of the previous two non-trivial   : 5009
0.39/0.58	# Contextual simplify-reflections      : 3
0.39/0.58	# Paramodulations                      : 4892
0.39/0.58	# Factorizations                       : 0
0.39/0.58	# NegExts                              : 6
0.39/0.58	# Equation resolutions                 : 292
0.39/0.58	# Propositional unsat checks           : 0
0.39/0.58	#    Propositional check models        : 0
0.39/0.58	#    Propositional check unsatisfiable : 0
0.39/0.58	#    Propositional clauses             : 0
0.39/0.58	#    Propositional clauses after purity: 0
0.39/0.58	#    Propositional unsat core size     : 0
0.39/0.58	#    Propositional preprocessing time  : 0.000
0.39/0.58	#    Propositional encoding time       : 0.000
0.39/0.58	#    Propositional solver time         : 0.000
0.39/0.58	#    Success case prop preproc time    : 0.000
0.39/0.58	#    Success case prop encoding time   : 0.000
0.39/0.58	#    Success case prop solver time     : 0.000
0.39/0.58	# Current number of processed clauses  : 466
0.39/0.58	#    Positive orientable unit clauses  : 99
0.39/0.58	#    Positive unorientable unit clauses: 3
0.39/0.58	#    Negative unit clauses             : 55
0.39/0.58	#    Non-unit-clauses                  : 309
0.39/0.58	# Current number of unprocessed clauses: 4694
0.39/0.58	# ...number of literals in the above   : 18368
0.39/0.58	# Current number of archived formulas  : 0
0.39/0.58	# Current number of archived clauses   : 17
0.39/0.58	# Clause-clause subsumption calls (NU) : 19134
0.39/0.58	# Rec. Clause-clause subsumption calls : 6442
0.39/0.58	# Non-unit clause-clause subsumptions  : 78
0.39/0.58	# Unit Clause-clause subsumption calls : 8044
0.39/0.58	# Rewrite failures with RHS unbound    : 2
0.39/0.58	# BW rewrite match attempts            : 50
0.39/0.58	# BW rewrite match successes           : 8
0.39/0.58	# Condensation attempts                : 0
0.39/0.58	# Condensation successes               : 0
0.39/0.58	# Termbank termtop insertions          : 130081
0.39/0.58	
0.39/0.58	# -------------------------------------------------
0.39/0.58	# User time                : 0.198 s
0.39/0.58	# System time              : 0.023 s
0.39/0.58	# Total time               : 0.221 s
0.39/0.58	# Maximum resident set size: 2152 pages
0.39/0.59	EOF